Erratum to: Minimizing total tardiness on parallel machines with preemptions
نویسندگان
چکیده
منابع مشابه
Minimizing total tardiness on parallel machines with preemptions
In this note, we correct a mistake which was made in the paper “Minimizing Total Tardiness on Parallel Machines with Preemptions’ (see Journal of Scheduling, Vol. 15, 2012, 193 200).
متن کاملA note on the paper "Minimizing total tardiness on parallel machines with preemptions" by Kravchenko and Werner [2010]
In this note, we point out two major errors in the paper “Minimizing total tardiness on parallel machines with preemptions” by Kravchenko and Werner [2010]. More precisely, they proved that both problems P |pmtn| ∑ Tj and P |rj , pj = p, pmtn| ∑ Tj are NP-Hard. We give a counterexample to their proofs, letting the complexity of these two problems open.
متن کاملMinimizing a Separable Convex Function on Parallel Machines with Preemptions
The basic scheduling problem we are dealing with in this paper is the following one. A set of jobs has to be scheduled on a set of parallel uniform machines. Each machine can handle at most one job at a time. All jobs have the same execution requirement. Each machine has a known speed. The processing of any job may be interrupted arbitrarily often and resumed later on any machine. The goal is t...
متن کاملMinimizing total tardiness and earliness on unrelated parallel machines with controllable processing times
Job scheduling has always been a challenging task in modern manufacturing and the most real life scheduling problems which involves multi-criteria and multi-machine environments. In this research our direction is largely motivated by the adoption of the Just-In-Time (JIT) philosophy in parallel machines system, where processing times of jobs are controllable. The goal of this paper is to minimi...
متن کاملScheduling on parallel identical machines to minimize total tardiness
This paper focuses on the problem of scheduling n independent jobs on m identical parallel machines for the objective of minimizing total tardiness of the jobs. We develop dominance properties and lower bounds, and develop a branch and bound algorithm using these properties and lower bounds as well as upper bounds obtained from a heuristic algorithm. Computational experiments are performed on r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Scheduling
سال: 2013
ISSN: 1094-6136,1099-1425
DOI: 10.1007/s10951-013-0313-5